An Rdf Metadata-based Weighted Semantic Pagerank Algorithm
نویسندگان
چکیده
PageRank evaluates the importance of Web pages with link relations. However, there is no direct method of evaluating the meaning of links in a hyperlink-based Web structure. This feature may cause problems in that pages containing many in-links are highly ranked without considering the meaning of the link relations among the pages. We therefore propose a novel ranking approach to directly analyze the meaning of links by transforming a hyperlink-based Web structure into a semantic-link-based Web structure. We extract semantic metadata from Web pages and construct a semantic-link-based Web structure using RDF model. We define a metric to evaluate the weight of the links for stratifying rank values based on their importance in the semantic-link-based Web structure. We implement the weighted semantic ranking algorithm in the MapReduce framework to consider large-scale semantic metadata. The results of our experiment show that our approach outperforms existing PageRank algorithms.
منابع مشابه
Weighted Semantic PageRank Using RDF Metadata on Hadoop
PageRank, a representative link-based algorithm, evaluates the importance of Web pages based on the number of inlinks each has. However, this feature may cause a problem in that pages with many in-links can be highly ranked regardless of their importance to the given query. Many methods have attempted to solve this problem by evaluating the weight of the links to stratify their importance. Howe...
متن کاملreview draft - - 30 April 2005 Finding and Ranking Knowledge on the Semantic Web ?
Swoogle is a system that helps knowledge engineers and software agents find knowledge on the web encoded in the semantic web languages RDF and OWL. Based on the search mechanisms provided in the previous version, we propose a novel semantic web navigation model and refine mechanisms for ranking the semantic web at various granularities. Although the semantic web is materialized on the Web, it i...
متن کاملReConRank: A Scalable Ranking Method for Semantic Web Data with Context?
We present an approach that adapts the well-known PageRank/HITS algorithms to Semantic Web data. Our method combines ranks from the RDF graph with ranks from the context graph, i.e. data sources and their linkage. We present performance evaluation results based on a large RDF data set obtained from the Web.
متن کاملبررسی واکنش موتورهای کاوش وب به پیشینههای فرادادهای مبتنی برروش ترکیبی دادههای خرد و روش دادههای پیوندی
The purpose of this research was to find out the reaction of Web Search Engines to Metadata records created based on the combined method of Rich Snippets and Linked Data. 200 metadata records in two groups (100 records as the control group with the normal structure and, 100 records created based on microdata and implemented in RDF/XML as experimental group) extracted from the information gatewa...
متن کاملUsing Your Desktop as Personal Digital Library
The recently arrived desktop search applications are weaker than their web siblings as they cannot rely on PageRank-like ranking methods which have revolutionized web search, since the documents are not well connected on the desktop. The general aim of this thesis proposal is to discuss how to enhance and contextualize desktop search based on semantic metadata collected from different contexts ...
متن کامل